Improved Mean and Variance Approximations for Belief Net Responses via Network Doubling

نویسندگان

  • Peter Hooper
  • Yasin Abbasi-Yadkori
  • Russell Greiner
  • Bret Hoehn
چکیده

A Bayesian belief network models a joint distribution with an directed acyclic graph representing dependencies among variables and network parameters characterizing conditional distributions. The parameters are viewed as random variables to quantify uncertainty about their values. Belief nets are used to compute responses to queries; i.e., conditional probabilities of interest. A query is a function of the parameters, hence a random variable. Van Allen et al. (2001, 2008) showed how to quantify uncertainty about a query via a delta method approximation of its variance. We develop more accurate approximations for both query mean and variance. The key idea is to extend the query mean approximation to a “doubled network” involving two independent replicates. Our method assumes complete data and can be applied to discrete, continuous, and hybrid networks (provided discrete variables have only discrete parents). We analyze several improvements, and provide empirical studies to demonstrate their effectiveness.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Quantifying the uncertainty of a belief net response: Bayesian error-bars for belief net inference

A Bayesian belief network models a joint distribution over variables using a DAG to represent variable dependencies and network parameters to represent the conditional probability of each variable given an assignment to its immediate parents. Existing algorithms assume each network parameter is fixed. From a Bayesian perspective, however, these network parameters can be random variables that re...

متن کامل

Mean Field Methods for a Special Class of Belief Networks

The chief aim of this paper is to propose mean-eld approximations for a broad class of Belief networks, of which sigmoid and noisy-or networks can be seen as special cases. The approximations are based on a powerful mean-eld theory suggested by Plefka. We show that Saul, Jaakkola, and Jordan's approach is the rst order approximation in Ple-fka's approach, via a variational derivation. The appli...

متن کامل

An Optimal Approximation Algorithm for Bayesian Inference

Approximating the inference probability Pr X xjE e in any sense even for a single evidence node E is NP hard This result holds for belief networks that are allowed to contain extreme conditional probabilities that is conditional probabilities arbitrarily close to Nevertheless all previous approximation algorithms have failed to approximate e ciently many inferences even for belief networks with...

متن کامل

Project Portfolio Risk Response Selection Using Bayesian Belief Networks

Risk identification, impact assessment, and response planning constitute three building blocks of project risk management. Correspondingly, three types of interactions could be envisioned between risks, between impacts of several risks on a portfolio component, and between several responses. While the interdependency of risks is a well-recognized issue, the other two types of interactions remai...

متن کامل

Optimal Placement and Sizing of Distributed Generation Via an Improved Nondominated Sorting Genetic Algorithm II

The use of distributed generation units in distribution networks has attracted the attention of network managers due to its great benefits. In this research, the location and determination of the capacity of distributed generation (DG) units for different purposes has been studied simultaneously. The multi-objective functions in the optimization model are reducing system line losses; reducing v...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009